منابع مشابه
Some Trigonometric Identities Involving Fibonacci and Lucas Numbers
In this paper, using the number of spanning trees in some classes of graphs, we prove the identities: Fn = 2n−1 n √
متن کاملSome Identities for Generalized Fibonacci and Lucas Sequences
In this study, we define a generalization of Lucas sequence {pn}. Then we obtain Binet formula of sequence {pn} . Also, we investigate relationships between generalized Fibonacci and Lucas sequences.
متن کاملIdentities Involving Lucas or Fibonacci and Lucas Numbers as Binomial Sums
As in [1, 2], for rapid numerical calculations of identities pertaining to Lucas or both Fibonacci and Lucas numbers we present each identity as a binomial sum. 1. Preliminaries The two most well-known linear homogeneous recurrence relations of order two with constant coefficients are those that define Fibonacci and Lucas numbers (or Fibonacci and Lucas sequences). They are defined recursively ...
متن کاملFibonacci-Lucas densities
Both Fibonacci and Lucas numbers can be described combinatorially in terms of 0− 1 strings without consecutive ones. In the present article we explore the occupation numbers as well as the correlations between various positions in the corresponding configurations. (2000) Mathematics Subject Classification: 11B39, 05A15
متن کاملNew Fibonacci and Lucas primes
Extending previous searches for prime Fibonacci and Lucas numbers, all probable prime Fibonacci numbers Fn have been determined for 6000 < n ≤ 50000 and all probable prime Lucas numbers Ln have been determined for 1000 < n ≤ 50000. A rigorous proof of primality is given for F9311 and for numbers Ln with n = 1097, 1361, 4787, 4793, 5851, 7741, 10691, 14449, the prime L14449 having 3020 digits. P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The College Mathematics Journal
سال: 1999
ISSN: 0746-8342,1931-1346
DOI: 10.1080/07468342.1999.11974086